SUFFICIENT CONDITION FOR THE EXISTENCE OF THREE DISJOINT THETA GRAPHS

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sufficient Condition for the Existence of Three Disjoint Theta Graphs

A theta graph is the union of three internally disjoint paths that have the same two distinct end vertices. We show that every graph of order n ≥ 12 and size at least ⌊ 11n−18 2 ⌋ contains three disjoint theta graphs. As a corollary, every graph of order n ≥ 12 and size at least ⌊ 11n−18 2 ⌋ contains three disjoint cycles of even length. 1. Terminology and introduction In this paper, we only co...

متن کامل

Independence Number and Disjoint Theta Graphs

The goal of this paper is to find vertex disjoint even cycles in graphs. For this purpose, define a θ-graph to be a pair of vertices u, v with three internally disjoint paths joining u to v. Given an independence number α and a fixed integer k, the results contained in this paper provide sharp bounds on the order f(k, α) of a graph with independence number α(G) ≤ α which contains no k disjoint ...

متن کامل

A sufficient condition for the existence of plane spanning trees on geometric graphs

Let P be a set of n ≥ 3 points in general position in the plane and let G be a geometric graph with vertex set P . If the number of empty triangles 4uvw in P for which the subgraph of G induced by {u, v, w} is not connected is at most n− 3, then G contains a non-self intersecting spanning tree.

متن کامل

A sufficient condition for the existence of a spanning Eulerian subgraph in 2-edge-connected graphs

vVe prove that if G is a 2-edge-connected graph of order n 2: 14 and max{d{u),d(v)} > n3!) for each pair of nonadjacent vertices u~ v of G. then G contains a spanning Eulerian subgraph and hence the line graph of G is Hamiltonian.

متن کامل

New sufficient condition for Hamiltonian graphs

Let G be a graph and α(G) be the independence number of G. For a vertex v ∈ V (G), d(v) and N(v) represent the degree of v and the neighborhood of v in G, respectively. In this paper, we prove that if G is a k-connected graph of order n, and if max{d(v) : v ∈ S} ≥ n/2 for every independent set S of G with |S| = k which has two distinct vertices x, y ∈ S satisfying 1 ≤ |N(x) ∩N(y)| ≤ α(G)− 1, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Korean Mathematical Society

سال: 2015

ISSN: 1015-8634

DOI: 10.4134/bkms.2015.52.1.287